منابع مشابه
Reconstructing Permutations from Identification Minors
We consider the problem whether a permutation of a finite set is uniquely determined by its identification minors. While there exist non-reconstructible permutations of every set with two, three, or four elements, we show that every permutation of a finite set with at least five elements is reconstructible from its identification minors. Moreover, we provide an algorithm for recovering a permut...
متن کاملReconstructing Permutations from Cycle Minors
The ith cycle minor of a permutation p of the set {1, 2, . . . , n} is the permutation formed by deleting an entry i from the decomposition of p into disjoint cycles and reducing each remaining entry larger than i by 1. In this paper, we show that any permutation of {1, 2, . . . , n} can be reconstructed from its set of cycle minors if and only if n ≥ 6. We then use this to provide an alternate...
متن کاملNonnegative Minors of Minor Matrices
Using the relationship between totally nonnegative matrices and directed acyclic weighted planar networks, we show that 2× 2 minors of minor matrices of totally nonnegative matrices are also nonnegative. We give a combinatorial interpretation for the minors of minor matrices in terms of the weights of families of paths in a network. Introduction By attaching weights to the edges of a finite, di...
متن کاملZero minors of total positive matrices
In this paper the structure of the zero minors of totally positive matrices is studied and applications are presented.
متن کاملEla Zero Minors of Totally Positive Matrices
In this paper the structure of the zero minors of totally positive matrices is studied and applications are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2011
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.09.018